Watershed by image foresting transform, tie-zone, and theoretical relationships with other watershed de nitions
نویسندگان
چکیده
To better understand the numerous solutions related to watershed transform (WT), this paper shows the relationships between some discrete de nitions of the WT: the watersheds based on image foresting transform (IFT), topographic distance (TD), local condition (LC), and minimum spanning forest (MSF). We demonstrate that the tie-zone (TZ) concept, that uni es the multiple solutions of a given WT, when applied to the IFT-WT, includes all the solutions predicted by the other paradigms: the watershed line of TD-WT is contained in the TZ of the IFT-WT, while the catchment basins of the former contain the basins of the latter; any solution of LCWT or MSF-WT is also solution of the IFT-WT. Furthermore, the TD-WT can be seen as the TZ transform of the LC-WT.
منابع مشابه
Watershed by image foresting transform, tie- zone, and theoretical relationships with other watershed definitions
To better understand the numerous solutions related to watershed transform (WT), this paper shows the relationships between some discrete definitions of the WT: the watersheds based on image foresting transform (IFT), topographic distance (TD), local condition (LC), and minimum spanning forest (MSF). We demonstrate that the tie-zone (TZ) concept, that unifies the multiple solutions of a given W...
متن کاملIFT-Watershed from Gray-Scale Marker
Abstract. The watershed transform and the morphological reconstruction are two of the most important operators for image segmentation in the framework of mathematical morphology. In many situations, the segmentation requires the classical watershed transform of a reconstructed image. In this paper, we introduce the IFT-watershed from gray scale marker a method to compute at same time, the recon...
متن کاملA partitioned algorithm for the image foresting transform
The Image Foresting Transform (IFT) is a powerful graph-based framework for the design and implementation of image processing operators. In this work we present the Partitioned IFT (PIFT), an algorithm that computes any IFT operator as a series of independent IFT-like computations. The PIFT makes parallelization of existing IFT operators easy, and allows the computation of IFTs in systems with ...
متن کاملInteractive 3D Heart Chamber Partitioning with a New Marker-Controlled Watershed Algorithm
Watershed transform has been widely used in medical image segmentation. One fundamental problem with it is over-segmentation. There are mainly two approaches to deal with this problem: hierarchical segmentation and segmentation with markers. The markers, either automatically extractedor interactively generated, aremostlyused in thehomotopymodification of morphological gradients prior to the wat...
متن کامل